Scaffold Topologies. 1. Exhaustive Enumeration up to Eight Rings
نویسندگان
چکیده
Mapping the chemical space of small organic molecules is approached from a theoretical graph theory viewpoint, in an effort to begin the systematic exploration of molecular topologies. We present an algorithm for exhaustive generation of scaffold topologies with up to eight rings and an efficient comparison method for graphs within this class. This method uses the return index, a topological invariant derived from the adjacency matrix of the graph. Furthermore, we describe an algorithm that verifies the adequacy of the comparison method. Applications of this method for chemical space exploration in the context of drug discovery are discussed. The key result is a unique characterization of scaffold topologies, which may lead to more efficient ways to query large chemical databases.
منابع مشابه
Scaffold Topologies. 2. Analysis of Chemical Databases
We have systematically enumerated graph representations of scaffold topologies for up to eight-ring molecules and four-valence atoms, thus providing coverage of the lower portion of the chemical space of small molecules (Pollock et al. J. Chem. Inf. Model., this issue). Here, we examine scaffold topology distributions for several databases: ChemNavigator and PubChem for commercially available c...
متن کاملSmart Enumeration: A Systematic Approach to Exhaustive Search
This paper explores the potential of smart enumeration: enumeration of a design space giving the effect of exhaustive search, while using heuristics to order and reduce the search space. We characterise smart enumeration as having several key properties, including carefully chosen problem domains and techniques to speed up the search, such as those that exploit symmetry. Our approach has been a...
متن کاملAlgebraic Symmetries of Generic Multidimensional Periodic Costas Arrays and their importance in the enumeration of Multidimensional Periodic Sonar Arrays
We present two symmetries of the generic multidimensional periodic Costas arrays over elementary abelian groups. Through exhaustive search, we observe that these two symmetries generate the Costas arrays for the enumeration up to p = 5 (5x5x24). Following the results, we conjecture that these generators characterize the group of symmetries of the generic (m+1)-dimensional periodic Costas arrays...
متن کاملHighly designable phenotypes and mutational buffers emerge from a systematic mapping between network topology and dynamic output.
Deciphering the design principles for regulatory networks is fundamental to an understanding of biological systems. We have explored the mapping from the space of network topologies to the space of dynamical phenotypes for small networks. Using exhaustive enumeration of a simple model of three- and four-node networks, we demonstrate that certain dynamical phenotypes can be generated by an atypi...
متن کاملMost Compact Parsimonious Trees
Construction of phylogenetic trees has traditionally focused on binary trees where all species appear on leaves, a problem for which numerous efficient solutions have been developed. Certain application domains though, such as viral evolution and transmission, paleontology, linguistics, and phylogenetic stemmatics, often require phylogeny inference that involves placing input species on ancestr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of chemical information and modeling
دوره 48 7 شماره
صفحات -
تاریخ انتشار 2008